A hybrid cuckoo search metaheuristic algorithm for solving single machine total weighted tardiness scheduling problems with sequence dependent setup times

An improved scatter search algorithm for the single machine total weighted tardiness scheduling problem with sequence-dependent setup times

In this paper, a scatter search algorithm with improved component modules is proposed to solve the single machine total weighted tardiness problem with sequence-dependent setup times. For diversification generation module, both random strategy based heuristics and construction heuristic are adopted to generate the diversified population. For improvement module, variable neighborhood search base...

Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times

This paper concerns the single machine total weighted tardiness scheduling with sequence-dependent setup times, usually referred as 1|sij | ∑ wjTj . In this NP-hard problem, each job has an associated processing time, due date and a weight. For each pair of jobs i and j, there may be a setup time before starting to process j in case this job is scheduled immediately after i. The objective is to...

A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times

This paper investigates a single machine scheduling problem with strong industrial background, named the prize-collecting single machine scheduling problem with sequence-dependent setup times. In this problem, there are n candidate jobs for processing in a single machine, each job has a weight (or profit) and a processing time, and during processing a symmetric sequence-dependent setup time exi...

A Hybrid Algorithm for Solving the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times

This work addresses the unrelated parallel machine scheduling problem where setup times are sequence-dependent and machine-dependent. The maximum completion time of the schedule, known as makespan, is considered as an objective to minimize. Few studies has been done about this problem, which is a motivation to the development of this work. Other motivations are the fact that it is NP-Hard and i...

Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups